منابع مشابه
Reachability-Based Approach for L2 Gain Approximation of Polynomial Systems
This paper considers a computational mechanism to approximate a class of polynomial systems with a reduced order model. The approach is based on estimate of the reachability set and a finite gain L2 stability condition. The approach benefits from the use of sum of squares programming where the computation is rendered tractable.
متن کاملPolynomial Approximation
Polynomials are very simple mathematical functions which have the flexibility to represent very general nonlinear relationships. Approximation of more complicated functions by polynomials is a basic building block for many numerical techniques. This article considers two distinct but related applications. The first is polynomial regression in which polynomials are used to model a nonlinear rela...
متن کاملExplicit solution of the finite time L2-norm polynomial approximation problem
Dedicated to Professor Alfredo Eisinberg on the Occasion of his 70th birthday Keywords: Polynomial approximation L 2-norm Hilbert matrix Laguerre polynomials Bernstein polynomials a b s t r a c t The aim of this paper is to present a new approach to the finite time L 2-norm polynomial approximation problem. A new formulation of this problem leads to an equivalent linear system whose solution ca...
متن کاملConstrained polynomial degree reduction in the L2-norm equals best weighted Euclidean approximation of Bézier coefficients
In this paper we show that the best constrained degree reduction of a given Bézier curve f of degree from n to m with Cα−1-continuity at the boundary in L2-norm is equivalent to the best weighted Euclidean approximation of the vector of Bernstein–Bézier (BB) coefficients of f from the vector of degree raised BB coefficients of polynomials of degree m with Cα−1-continuity at the boundary. 2003...
متن کاملPolynomial-Time Approximation Schemes
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity survivable-network design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on both orientable and nonorientable surfaces. This work generalizes the PTAS frameworks of Borradaile, Klein, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Mathematica Journal
سال: 2017
ISSN: 1097-1610
DOI: 10.3888/tmj.19-2